DACTAL: divide-and-conquer trees (almost) without alignments

DACTAL: divide-and-conquer trees (almost) without alignments

MOTIVATION While phylogenetic analyses of datasets containing 1000-5000 sequences are challenging for existing methods, the estimation of substantially larger phylogenies poses a problem of much greater complexity and scale. METHODS We present DACTAL, a method for phylogeny estimation that produces trees from unaligned sequence datasets without ever needing to estimate an alignment on the ent...

Divide and Conquer

An instance of the given problem is divided into easier instances of the same problem, which are solved recursively and then combined to create a solution to the original instance. Of course, divide and conquer is not suitable for every problem. A divide and conquer approach will only work if the problem is easily divided into a small number of easier sub-problems, and the solution to the entir...

Divide and (Iteratively) Conquer!

The Iterative Multi-Agent (IMA) Method works by breaking down a search problem into many sub-problems, each to be solved separately. Independent problem solving agents work on the sub-problems and use iteration to handle any interaction between the sub-problems. Each agent knows about a subset of the whole problem and cannot solve it all by itself. The agents, working in parallel, can use any m...

Cheaters divide and conquer

Three 'killer genes' in one species of fission yeast act selfishly and keep it reproductively isolated from a closely related species.

Divide-And-Conquer Sorting